Practical Nearest Neighbor Search in the Plane
نویسندگان
چکیده
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory and faster than the state of the art in practice. The algorithm and proof are both simple and the experimental results clearly show that we can beat the state of the art on most distributions in two dimensions.
منابع مشابه
An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملDerivation of Theoretical Formulas of Accuracy on Accessing Neighboring Buckets in Hash-Based Approximate Nearest Neighbor Search
Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory. Generally, there are the relationships of trade-off among accuracy, processing time and memory amount. Therefore, analysis on the relationships is an important task for practical application of the approximate nearest neighbor search method. In this paper, we construct a model...
متن کاملSubspace Approximation for Approximate Nearest Neighbor Search in NLP
Most natural language processing tasks can be formulated as the approximated nearest neighbor search problem, such as word analogy, document similarity, machine translation. Take the questionanswering task as an example, given a question as the query, the goal is to search its nearest neighbor in the training dataset as the answer. However, existing methods for approximate nearest neighbor sear...
متن کاملTowards Optimal ǫ-Approximate Nearest Neighbor Algorithms in Constant Dimensions
The nearest neighbor (NN) problem on a set of n points P , is to build a data structure that when given a query point q, finds p ∈ P such that for all p′ ∈ P , d(p, q) ≤ d(p′, q). In low dimensions (2 or 3), this is considered a solved problem, with techniques such as Voronoi diagrams providing practical, log-height tree structures. Finding algorithms that work in arbitrary dimension has been m...
متن کامل